Hamiltonian Cycle within Extended OTIS-Cube Topology

This paper introduces a complete description of constructing a Hamiltonian cycle in the Extended OTIS-n-Cube topology. The recently proposed network has many good topological features such as regular degree, semantic structure, low diameter, and ability to embed graphs and cycles. Constructing a Hamiltonian cycle is an important feature for any topology due to the importance of broadcast messages within networks. This paper proposes an algorithm to form a Hamiltonian cycle in the extended OTIS-n-Cube Interconnection network. Examples are also presented in different network sizes to show how Hamiltonian cycles are constructed. Key-Words: Interconnection Networks, OTIS-n-Cube, Topological Properties, Routing Algorithm.